Origin of Scaling Behavior of Protein Packing Density: A Sequential Monte Carlo Study of Compact Long Chain Polymers

نویسندگان

  • Jinfeng Zhang
  • Rong Chen
  • Chao Tang
  • Jie Liang
چکیده

Single domain proteins are thought to be tightly packed. The introduction of voids by mutations is often regarded as destabilizing. In this study we show that packing density for single domain proteins decreases with chain length. We find that the radius of gyration provides poor description of protein packing but the alpha contact number we introduce here characterize proteins well. We further demonstrate that protein-like scaling relationship between packing density and chain length is observed in off-lattice self-avoiding walks. A key problem in studying compact chain polymer is the attrition problem: It is difficult to generate independent samples of compact long self-avoiding walks. We develop an algorithm based on the framework of sequential Monte Carlo and succeed in generating populations of compact long chain off-lattice polymers up to length N = 2, 000. Results based on analysis of these chain polymers suggest that maintaining high packing density is only characteristic of short chain proteins. We found that the scaling behavior of packing density with chain length of proteins is a generic feature of random polymers satisfying loose constraint in compactness. We conclude that proteins are not optimized by evolution to eliminate packing voids.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Statistical Geometry of Packing Defects of Lattice Chain Polymer from Enumeration and Sequential Monte Carlo Method

Voids exist in proteins as packing defects and are often associated with protein functions. We study the statistical geometry of voids in two-dimensional lattice chain polymers. We define voids as topological features and develop a simple algorithm for their detection. For short chains, void geometry is examined by enumerating all conformations. For long chains, the space of void geometry is ex...

متن کامل

The mean field to Ising crossover in the critical behavior of polymer mixtures : a finite size scaling analysis of Monte Carlo simulations

Monte Carlo simulations of the bond fluctuation model of symmetrical polymer mixtures (chain lengths N~ = N~ = N) are analyzed near the critical temperature T~(N ) of their unmixing transition. Two choices of interaction range are studied, using a square-well potential with effective coordination number z~~~=14 or z~aws, respectively, at a volume fraction # = 0.5 of occupied lattice sites, and ...

متن کامل

Gyration Radius and Energy Study at Different Temperatures for Acetylcholine Receptor Protein in Gas Phase by Monte Carlo, Molecular and Langevin Dynamics Simulations

The determination of gyration radius is a strong research for configuration of a Macromolecule. Italso reflects molecular compactness shape. In this work, to characterize the behavior of theprotein, we observe quantities such as the radius of gyration and the average energy. We studiedthe changes of these factors as a function of temperature for Acetylcholine receptor protein in gasphase with n...

متن کامل

Energy study at different solvents for potassium Channel Protein by Monte Carlo, Molecular and Langevin Dynamics Simulations

Potassium Channels allow potassium flux and are essential for the generation of electric current acrossexcitable membranes. Potassium Channels are also the targets of various intracellular controlmechanisms; such that the suboptimal regulation of channel function might be related to pathologicalconditions. Realistic studies of ion current in biologic channels present a major challenge for compu...

متن کامل

Evaluating Quasi-Monte Carlo (QMC) algorithms in blocks decomposition of de-trended

The length of equal minimal and maximal blocks has eected on logarithm-scale logarithm against sequential function on variance and bias of de-trended uctuation analysis, by using Quasi Monte Carlo(QMC) simulation and Cholesky decompositions, minimal block couple and maximal are founded which are minimum the summation of mean error square in Horest power.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003